Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithms and Data Structures [[electronic resource] ] : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri
| Algorithms and Data Structures [[electronic resource] ] : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri |
| Autore | Morin Pat |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (732 pages) |
| Disciplina |
005.73
003.54 |
| Altri autori (Persone) | SuriSubhash |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Information theory Algorithms Computer engineering Computer networks Computer science—Mathematics Discrete mathematics Computer graphics Data Structures and Information Theory Design and Analysis of Algorithms Computer Engineering and Networks Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-031-38906-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Geometric Spanning Trees Minimizing the Wiener Index -- The Mutual Visibility Problem for Fat Robots -- Faster Algorithms for Cycle Hitting Problems on Disk Graphs -- Tight analysis of the lazy algorithm for open online dial-a-ride -- Online TSP with Known Locations -- Socially Fair Matching: Exact and Approximation Algorithms -- A Parameterized Approximation Scheme for Generalized Partial Vertex Cover -- Dominator Coloring and CD Coloring in Almost Cluster Graphs -- Tight Approximation Algorithms for Ordered Covering -- Online Minimum Spanning Trees with Weight Predictions -- Compact Distance Oracles with Large Sensitivity and Low Stretch -- Finding Diameter-Reducing Shortcuts in Trees -- Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon -- Online Interval Scheduling with Predictions -- On Length-Sensitive Frechet Similarity -- Hardness of Graph-Structured Algebraic and Symbolic Problems-. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs -- Efficient k-center algorithms for planar points in convex position -- Classification via Two-Way Comparisons (extended abstract) -- Improved Bounds for Discrete Voronoi Games -- General Space-Time Tradeoffs via Relational Queries -- Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs -- Differentially Private Range Query on Shortest Paths -- Revisiting Graph Persistence for Updates and Efficiency -- Block Crossings in One-Sided Tanglegrams -- Observation Routes and External Watchman Routes -- Lower Bounds for Non-Adaptive Shortest Path Relaxation -- Shortest coordinated motion for square robots -- Linear Layouts of Bipartite Planar Graphs -- Adaptive Data Structures for 2D Dominance Colored Range Counting -- Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent -- External-Memory Sorting with Comparison Errors -- Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs -- Reconfiguration of Time-Respecting Arborescences -- Algorithmic Theory of Qubit Routing -- 3-Coloring C4 or C3-free Diameter Two Graphs -- Colored Constrained Spanning Tree on Directed Graphs -- Geometric Hitting Set for Line-Constrained Disks -- An ETH-Tight Algorithm for Bidirected Steiner Connectivity -- From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy -- Fully dynamic clustering and diversity maximization in doubling metrics -- Quick Minimization of Tardy Processing Time on a Single Machine -- Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location -- Approximating the discrete center line segment in linear time -- Density Approximation for Moving Groups -- Dynamic Convex Hulls under Window-Sliding Updates -- Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs. |
| Record Nr. | UNINA-9910736011703321 |
Morin Pat
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Data Structures [[electronic resource] ] : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri
| Algorithms and Data Structures [[electronic resource] ] : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri |
| Autore | Morin Pat |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (732 pages) |
| Disciplina |
005.73
003.54 |
| Altri autori (Persone) | SuriSubhash |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Information theory Algorithms Computer engineering Computer networks Computer science—Mathematics Discrete mathematics Computer graphics Data Structures and Information Theory Design and Analysis of Algorithms Computer Engineering and Networks Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Computer Graphics |
| ISBN | 3-031-38906-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Geometric Spanning Trees Minimizing the Wiener Index -- The Mutual Visibility Problem for Fat Robots -- Faster Algorithms for Cycle Hitting Problems on Disk Graphs -- Tight analysis of the lazy algorithm for open online dial-a-ride -- Online TSP with Known Locations -- Socially Fair Matching: Exact and Approximation Algorithms -- A Parameterized Approximation Scheme for Generalized Partial Vertex Cover -- Dominator Coloring and CD Coloring in Almost Cluster Graphs -- Tight Approximation Algorithms for Ordered Covering -- Online Minimum Spanning Trees with Weight Predictions -- Compact Distance Oracles with Large Sensitivity and Low Stretch -- Finding Diameter-Reducing Shortcuts in Trees -- Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon -- Online Interval Scheduling with Predictions -- On Length-Sensitive Frechet Similarity -- Hardness of Graph-Structured Algebraic and Symbolic Problems-. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs -- Efficient k-center algorithms for planar points in convex position -- Classification via Two-Way Comparisons (extended abstract) -- Improved Bounds for Discrete Voronoi Games -- General Space-Time Tradeoffs via Relational Queries -- Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs -- Differentially Private Range Query on Shortest Paths -- Revisiting Graph Persistence for Updates and Efficiency -- Block Crossings in One-Sided Tanglegrams -- Observation Routes and External Watchman Routes -- Lower Bounds for Non-Adaptive Shortest Path Relaxation -- Shortest coordinated motion for square robots -- Linear Layouts of Bipartite Planar Graphs -- Adaptive Data Structures for 2D Dominance Colored Range Counting -- Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent -- External-Memory Sorting with Comparison Errors -- Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs -- Reconfiguration of Time-Respecting Arborescences -- Algorithmic Theory of Qubit Routing -- 3-Coloring C4 or C3-free Diameter Two Graphs -- Colored Constrained Spanning Tree on Directed Graphs -- Geometric Hitting Set for Line-Constrained Disks -- An ETH-Tight Algorithm for Bidirected Steiner Connectivity -- From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy -- Fully dynamic clustering and diversity maximization in doubling metrics -- Quick Minimization of Tardy Processing Time on a Single Machine -- Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location -- Approximating the discrete center line segment in linear time -- Density Approximation for Moving Groups -- Dynamic Convex Hulls under Window-Sliding Updates -- Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs. |
| Record Nr. | UNISA-996542665403316 |
|
Morin Pat
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Open data structures : an introduction / / Pat Morin
| Open data structures : an introduction / / Pat Morin |
| Autore | Morin Pat |
| Edizione | [31th ed.] |
| Pubbl/distr/stampa | Athabasca University Press, 2013 |
| Descrizione fisica | 1 online resource (337 p.) |
| Disciplina | 005.73 |
| Collana | OPEL (Open Paths to Enriched Learning) |
| Soggetto topico |
Data structures (Computer science)
Computer algorithms |
| Soggetto non controllato |
algorithms
java data structures programming |
| ISBN | 1-927356-39-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Array-based lists -- Linked lists -- Skiplists -- Hash tables -- Binary trees -- Random binary search trees -- Scapegoat trees -- Red-black trees -- Heaps -- Sorting algorithms -- Graphs -- Data structures for integers -- External memory searching. |
| Record Nr. | UNINA-9910139028803321 |
|
Morin Pat
|
||
| Athabasca University Press, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||